Weak Equivalence for Constraint Sets
نویسندگان
چکیده
We describe a generalization of equivalence between constraint sets, called weak equivalence. This new equivalence relation takes into account that not all variables have the same function in a constraint set and therefore distinguishes between restriction variables and intermediate variables. We explore the properties of weak equivalence and its underlying notion of weak implication with an axiomatic approach. In addition a complete set of axioms for weak implication is presented. With examples derived from the declarative rule language RL we show the applicability of weak equivalence to constraint solving.
منابع مشابه
Reducing Weak to Strong Bisimilarity in CCP
Concurrent constraint programming (ccp) is a well-established model for concurrency that singles out the fundamental aspects of asynchronous systems whose agents (or processes) evolve by posting and querying (partial) information in a global medium. Bisimilarity is a standard behavioural equivalence in concurrency theory. However, only recently a well-behaved notion of bisimilarity for ccp, and...
متن کاملHomotopy Theories for Diagrams of Spaces
We show that the category of diagrams of topological spaces (or simplicial sets) admits many interesting model category structures in the sense of Quillen [8]. The strongest one renders any diagram of simplicial complexes and simplicial maps between them both fibrant and cofibrant. Namely, homotopy invertible maps between such are the weak equivalences and they are detectable by the "spaces of ...
متن کاملRefining the Undecidability Border of Weak Bisimilarity
Weak bisimilarity is one of the most studied behavioural equivalences. This equivalence is undecidable for pushdown processes (PDA), process algebras (PA), and multiset automata (MSA, also known as parallel pushdown processes, PPDA). Its decidability is an open question for basic process algebras (BPA) and basic parallel processes (BPP). We move the undecidability border towards these classes b...
متن کاملConvex Generalized Semi-Infinite Programming Problems with Constraint Sets: Necessary Conditions
We consider generalized semi-infinite programming problems in which the index set of the inequality constraints depends on the decision vector and all emerging functions are assumed to be convex. Considering a lower level constraint qualification, we derive a formula for estimating the subdifferential of the value function. Finally, we establish the Fritz-John necessary optimality con...
متن کاملA THOMASON MODEL STRUCTURE ON THE CATEGORY OF SMALL n-FOLD CATEGORIES
We construct a cofibrantly generated Thomason model structure on the category of small n-fold categories and prove that it is Quillen equivalent to the standard model structure on the category of simplicial sets. An n-fold functor is a weak equivalence if and only if the diagonal of its n-fold nerve is a weak equivalence of simplicial sets. We introduce an n-fold Grothendieck construction for m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1991